Optimal Shift-Or String Matching Algorithm for Multiple Patterns
نویسندگان
چکیده
In this paper, we develop a new algorithm for handling multiple patterns, which is based on average optimal shift-or algorithm. We have assumed that the pattern representation fits into a single computer word and length of each pattern is equal. We have adopted the concept of classes of characters for handling multiple patterns. We compare the performance of the proposed algorithm with the standard shift-or algorithm. The experimental results show that our algorithm is the faster in most of the cases.
منابع مشابه
Average-Optimal Multiple Approximate String Matching
We present a new algorithm for multiple approximate string matching, based on an extension of the optimal (on average) singlepattern approximate string matching algorithm of Chang and Marr. Our algorithm inherits the optimality and is also competitive in practice. We present a second algorithm that is linear time and handles higher difference ratios. We show experimentally that our algorithms a...
متن کاملEfficient Wu Manber String Matching Algorithm for Large Number of Patterns
String matching is one of the most important concept used in computer science in various real life applications like as Intrusion detection system, Data mining, Plagiarism detection system. There are many string matching algorithms which help to find pattern from the text. These algorithms are categorized in single string matching and multiple string matching. The Wu-Manber (WM) algorithm is mu...
متن کاملImproved Single and Multiple Approximate String Matching
We present a new algorithm for multiple approximate string matching. It is based on reading backwards enough `-grams from text windows so as to prove that no occurrence can contain the part of the window read, and then shifting the window. Three variants of the algorithm are presented, which give different tradeoffs between how much they work in the window and how much they shift it. We show an...
متن کاملAverage-Case Optimal Approximate Circular String Matching
Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the...
متن کاملA fast implementation of the Boyer–Moore string matching algorithm
String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute a combinatorial shift function (“best matching shift”) of the well-known Boyer–Moore string matching algorithm. Moreover we conduct experiments showing that the algorithm using this best matching shift is the most efficient in particular cases such as the search for patterns ...
متن کامل